Reasoning About Active Network Protocols
نویسندگان
چکیده
Active Networks allow users to \program" the network infrastructure, by injecting information that describes or controls a distributed algorithm to be executed for the user by the network infrastructure. The nature of the services that can be implemented with such a facility is determined by the programming interface to the active network, i.e. the set of abstractions it exposes to users. The complexity of this interface may range from a few simple parameters to a completely general programming language. We present a model that supports reasoning independently about the correctness of both the underlying active network platformand the algorithms injected into it, in a manner that admits the full range of possible programming interfaces. The model is described without relying on any particular formalism. The interaction between the underlying platform and the userinjected program is captured in a specialized form of program composition that allows properties of each to be preserved. The use of the model is illustrated via an example dealing with mobility. For the example, we use the UNITY formalism to be more precise about the programs and properties that are preserved.
منابع مشابه
Energy optimization based on routing protocols in wireless sensor network
Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...
متن کاملFormal Support for Standardizing Protocols with State
Many cryptographic protocols are designed to achieve their goals using only messages passed over an open network. Numerous tools, based on well-understood foundations, exist for the design and analysis of protocols that rely purely on message passing. However, these tools encounter difficulties when faced with protocols that rely on non-local, mutable state to coordinate several local sessions....
متن کاملSpecifying and Verifying Crypto-Protocols at the Design Level
The clear semantics of Abstract State Machines is tailored to the analysis of crypto-protocols in a realistic environment threatened by an active eavesdropper. The model is intermediate between the abstract approaches based on belief logics, and the lower level approaches based on traces of atomic actions. Properties are stated at the design level with little formal overhead, but reasoning abou...
متن کاملGDP Festschrift ENTCS , to appear Protocol Composition Logic ( PCL )
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a process calculus with actions for possible protocol steps including generating new random numbers, sending and receiving messages, and performing decryption and digital signature verification actions. The proof system con...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کامل